Necessity measure optimization in linear programming problems with fuzzy polytopes

نویسنده

  • Masahiro Inuiguchi
چکیده

In this paper,we treat fuzzy linear programming problemswith uncertain parameterswhose ranges are specified as fuzzy polytopes. The problem is formulated as a necessity measure optimization model. It is shown that the problem can be reduced to a semi-infinite programming problem and solved by a combination of a bisection method and a relaxation procedure. An algorithm in which the bisection method and the relaxation procedure converge simultaneously is proposed. A simple numerical example is given to illustrate the solution procedure. © 2007 Elsevier B.V. All rights reserved.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Solving Fully Fuzzy Linear Programming Problems with Zero-One Variables by Ranking Function

Jahanshahloo has suggested a method for the solving linear programming problems with zero-one variables‎. ‎In this paper we formulate fully fuzzy linear programming problems with zero-one variables and a method for solving these problems is presented using the ranking function and also the branch and bound method along with an example is presented.

متن کامل

Fuzzy Random Linear Optimization under Possibilistic Downside Risk Measures: Minimization of Possibilistic Low Partial Moment

This paper considers new downside risk-aversion models for linear optimization (linear programming) with discrete fuzzy random variables. Through new downside risk measures for fuzzy stochastic optimization problems, possibilistic low partial moment (PLPM) models are constructed by incorporating possibility and necessity measures into classical low partial moment. To provide practical models, t...

متن کامل

Linear Programming, the Simplex Algorithm and Simple Polytopes

In the first part of the paper we survey some far reaching applications of the basis facts of linear programming to the combinatorial theory of simple polytopes. In the second part we discuss some recent developments concurring the simplex algorithm. We describe sub-exponential randomized pivot roles and upper bounds on the diameter of graphs of polytopes. 

متن کامل

Exponential membership function and duality gaps for I-fuzzy linear programming problems

Fuzziness is ever presented in real life decision making problems. In this paper, we adapt the pessimistic approach tostudy a pair of linear primal-dual problem under intuitionistic fuzzy (I-fuzzy) environment and prove certain dualityresults. We generate the duality results using exponential membership and non-membership functions to represent thedecision maker’s satisfaction and dissatisfacti...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Fuzzy Sets and Systems

دوره 158  شماره 

صفحات  -

تاریخ انتشار 2007